Improved identification schemes based on error-correcting codes

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved identity-based identification using correcting codes

In this paper, a new identity-based identification scheme based on error-correcting codes is proposed. Two well known code-based schemes are combined : the signature scheme by Courtois, Finiasz and Sendrier and an identification scheme by Stern. A proof of security for the scheme in the Random Oracle

متن کامل

Identity-based identification and signature schemes using correcting codes

In this paper, we propose a new identity-based authentication (and signature) scheme based on error-correcting codes. This scheme is up to date the first identity-based scheme not based on number theory. The scheme combines two well known code-based schemes: the signature scheme of Courtois, Finiasz and Sendrier and the zero-knowledge authentication scheme of Stern (which may also be used for s...

متن کامل

Function Hiding Based on Error Correcting Codes

1. Supported by FCT grant PRAXIS XXI/BD/13875/97 Abstract This paper presents an original approach to the problem of function hiding based on Error Correcting Codes and evaluates the security of this approach. The novelty of the technique consists in using Error Correcting Codes to hide functions instead of encrypting data vectors. This protocol mainly deals with the issue of secure evaluation ...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

Improved Combinatorial Bounds on Variable Length Error Correcting Codes

Theory of error correcting codes mostly considers all words of same lengths. Mathematical tools of linear algebra and finite fields greatly helped in its development. However all words of equal lengths idea compromises with efficiency which can be better achieved through variable length codes for noisy channels. There is quite some interest and scope in error coding through variable length cod ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing

سال: 1997

ISSN: 0938-1279,1432-0622

DOI: 10.1007/s002000050053